Hyperplane Arrangements with Large Average Diameter
نویسندگان
چکیده
The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed dimension. We give the exact value of the largest possible average diameter for all simple arrangements in dimension 2, for arrangements having at most the dimension plus 2 hyperplanes, and for arrangements having 6 hyperplanes in dimension 3. In dimension 3, we give lower and upper bounds which are both asymptotically equal to the dimension.
منابع مشابه
ar X iv : 0 71 0 . 03 28 v 1 [ m at h . M G ] 1 O ct 2 00 7 Hyperplane Arrangements with Large Average Diameter
The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed dimension. We give the exact value of the largest possible average diameter for all simple arrangements in dimension 2, for arrangements having at most the dimensio...
متن کاملAdvanced Optimization Laboratory Title : Hyperplane Arrangements with Large Average Diameter
Let ∆A(n, d) denote the largest possible average diameter of a bounded cell of a simple arrangement defined by n hyperplanes in dimension d. We have ∆A(n, 2) ≤ 2+ 2 n−1 in the plane, and ∆A(n, 3) ≤ 3+ 4 n−1 in dimension 3. In general, the average diameter of a bounded cell of a simple arrangement is conjectured to be less than the dimension; that is, ∆A(n, d) ≤ d. We propose an hyperplane arran...
متن کاملHyperplane Arrangements with Large Average Diameter: a Computational Approach
We consider the average diameter of a bounded cell of a simple arrangement defined by n hyperplanes in dimension d. In particular, we investigate the conjecture stating that the average diameter is no more than the dimension d. Previous results in dimensions 2 and 3 suggested that specific extensions of the cyclic arrangement might achieve the largest average diameter. We show that the suggeste...
متن کاملCounting External Facets of Simple Hyperplane Arrangements
The number of external facets of a simple arrangement depends on its combinatorial type. A computation framework for counting the number of external facets is introduced and improved by exploiting the combinatorial structure of the set of sign vectors of the cells of the arrangement. 1 Background and introduction n hyperplanes in dimension d form a hyperplane arrangement. An hyperplane arrangem...
متن کامل20 09 Diameter of Reduced Words
For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to supersolvable hyperplane arrangements.
متن کامل